Evaluation strategies for monadic computations
نویسندگان
چکیده
منابع مشابه
Evaluation strategies for monadic computations
computations and comonads. In this paper, we extended monads with one component of a comonadic structure. Although less widespread than monads, comonads are also useful for capturing abstract computations in functional programming. They have been used for dataflow programming [23], array programming [17], environment passing, and more [8]. In general, comonads can be used to describe context-de...
متن کاملTracing monadic computations and representing effects
In functional programming, monads are supposed to encapsulate computations, effectfully producing the final result, but keeping to themselves the means of acquiring it. For various reasons, we sometimes want to reveal the internals of a computation. To make that possible, in this paper we introduce monad transformers that add the ability to automatically accumulate observations about the course...
متن کاملEncoding Monadic Computations in C# Using Iterators
Many programming problems can be easily solved if we express them as computations with some non-standard aspect. This is a very important problem, because today we’re struggling for example to efficiently program multi-core processors and to write asynchronous code. Unfortunately main-stream languages such as Java or C# don’t support any direct way for encoding unrestricted nonstandard computat...
متن کاملComputations by fly-automata beyond monadic second-order logic
The validity of a monadic-second order (MS) expressible property can be checked in linear time on graphs of bounded tree-width or clique-width given with appropriate decompositions. This result is proved by constructing from the MS sentence expressing the property and an integer that bounds the tree-width or clique-width of the input graph, a finite automaton intended to run bottom-up on the al...
متن کاملExploring Tuning Strategies for Quantum Chemistry Computations
Effective execution of applications using a parallel computing environment that share resources such as network bandwidth, I/O and main memory require that some sort of adaptive mechanism be put in place which enables efficient usage of these resources. The adaptation adjusts the most computationally intensive part of the application thus leading to an efficient execution. General Atomic and Mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.76.7